Visual Programming with Recursion Patterns in Interaction Nets
نویسندگان
چکیده
In this paper we propose to use Interaction Nets as a formalism for Visual Functional Programming. We consider the use of recursion patterns as a programming idiom, and introduce a suitable archetype/instantiation mechanism for interaction agents, which allows one to define agents whose behaviour is based on recursion patterns.
منابع مشابه
Functional Programming and Program Transformation with Interaction Nets
In this paper we propose to use Interaction Nets as a formalism for Visual Functional Programming. We consider the use of recursion patterns and introduce a suitable archetype/instantiation mechanism for interaction agents. We also consider program transformation by fusion, a well-known transformation technique, and show that this extends smoothly to our visual programming framework. Examples o...
متن کاملEncoding Iterators in Interaction Nets
We propose a method for encoding iterators (recursion operators) using interaction nets. The method can be used to obtain a visual notation for functional programs, and also to extend with recursion the many translations of the λ-calculus into interaction nets, which have been proposed as efficient implementation mechanisms. We exemplify the method with a number of list-processing examples that...
متن کاملRecursive Functions with Pattern Matching in Interaction Nets
We compile functional languages with pattern-matching features into interaction nets, extending the wellknown efficient evaluation strategies developed for the pure λ-calculus. We give direct translations of recursion and pattern matching for languages with a strict matching semantics, implementing an evaluation strategy that is natural in interaction nets and has a high degree of sharing.
متن کاملIterators, Recursors and Interaction Nets
We propose a method for encoding iterators (and recursion operators in general) using interaction nets (INs). There are two main applications for this: the method can be used to obtain a visual notation for functional programs; and it can be used to extend the existing translations of the λ-calculus into INs to languages with recursive types.
متن کاملType assignment and termination of interaction nets
Interaction nets have proved to be a useful tool for the study of computational aspects of diierent formalisms (e.g.-calculus, term rewriting systems), but they are also a programming paradigm in themselves, and this is actually how they were introduced by Lafont. In this paper we consider semi-simple interaction nets as a programming language, and present a type assignment system using interse...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- ECEASST
دوره 6 شماره
صفحات -
تاریخ انتشار 2007